Communication Complexity of One-Shot Remote State Preparation
نویسندگان
چکیده
منابع مشابه
Communication Complexity of One-Shot Remote State Preparation
Quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum state from one party to another. Remote state preparation (RSP) is a similar distributed task in which the sender knows the entire classical description of the state to be sent. (This may also be viewed as the task of non-oblivious compression of a single sample from an ensemble of quantu...
متن کاملCommunication complexity of remote state preparation with entanglement
Definition 1 (Remote state preparation) Let Alice, who knows the function E, get an input x ∈ X. Alice and Bob are required to communicate and at the end of the communication Bob should have a quantum state ρx such that F (ρx, E(x)) ≥ 1− ǫ, for some 0 ≤ ǫ < 1. Alice and Bob may start with some prior entanglement between them. In several papers in the remote state preparation problem, Alice inst...
متن کاملRemote state preparation.
Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted. We show that the asymptotic classical communication cost of RSP is one bit per qubit--half that of teleportation--and even less when transmitting...
متن کاملOptimal remote state preparation.
We prove that it is possible to remotely prepare an ensemble of noncommuting mixed states using communication equal to the Holevo information for this ensemble. This remote preparation scheme may be used to convert between different ensembles of mixed states in an asymptotically lossless way, analogous to concentration and dilution for entanglement.
متن کاملOne-shot Multiparty State Merging
We present a protocol for performing state merging when multiple parties share a single copy of a mixed state, and analyze the entanglement cost in terms of minand maxentropies. Our protocol allows for interpolation between corner points of the rate region without the need for time-sharing, a primitive which is not available in the one-shot setting. We also compare our protocol to the more naiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2811509